Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
نویسندگان
چکیده
Unreliable failure detectors, proposed by Chandra and Toueg [2], are mechanisms that provide information about process failures. In [2], eight classes of failure detectors were defined, depending on how accurate this information is, and an algorithm implementing a failure detector of one of these classes in a partially synchronous system was presented. This algorithm is based on all-to-all communication, and periodically exchanges a number of messages that is quadratic on the number of processes. To our knowledge, no other algorithm implementing these classes of unreliable failure detectors has been proposed. In this paper, we present a family of distributed algorithms that implement four classes of unreliable failure detectors in partially synchronous systems. Our algorithms are based on a logical ring arrangement of the processes, which defines the monitoring and failure information propagation pattern. The resulting algorithms periodically exchange at most a linear number of messages.
منابع مشابه
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
Unreliable failure detectors were proposed by Chandra and Toueg as mechanisms that provide information about process failures. Chandra and Toueg defined eight classes of failure detectors, depending on how accurate this information is, and presented an algorithm implementing a failure detector of one of these classes in a partially synchronous system. This algorithm is based on all-to-all commu...
متن کاملImplementing the Weakest Failure Detector for Solving Consensus
The concept of unreliable failure detector was introduced by Chandra and Toueg as a mechanism that provides information about process failures. This mechanism has been used to solve several agreement problems, like Consensus. In this paper, algorithms that implement failure detectors in partially synchronous systems are presented. First two simple algorithms of the weakest class to solve Consen...
متن کاملFast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lack of bounded finite delays is antagonistic with timeliness requirements. We show how to circumvent this apparent contradiction, via the principle of “late binding” of a solution to some (partially) synchronous model. ...
متن کاملDesigning Efficient Algorithms for the Eventually Perfect Failure Detector Class
This paper focuses on the design of unreliable failure detectors of the Eventually Perfect class (3P) in crash-prone partially synchronous systems. We adopt a monitoring mechanism based on heartbeats over a logical ring arrangement of processes as the common design feature. This provides good communication efficiency, a performance parameter which refers to the number of links that carry messag...
متن کاملFailure Detection with Booting in Partially Synchronous Systems
Unreliable failure detectors are a well known means to enrich asynchronous distributed systems with time-free semantics that allow to solve consensus in the presence of crash failures. Implementing unreliable failure detectors requires a system that provides some synchrony, typically an upper bound on end-to-end message delays. Recently, we introduced an implementation of the perfect failure de...
متن کامل